模拟污染潮湿大气环境下LY12CZ、LC4CS铝合金腐蚀行为研究

建立了基于电化学噪声测试技术(EN)的铝合金大气腐蚀实时监检测方法.设计并制作了配套的电解池.运用所建立方法测试并计算得到了LY12CZ、LC4CS铝合金在pH值为中性恒温恒湿的模拟近海、海洋大气以及工业污染大气环境中的噪声电阻Rn和电位噪声功率密度谱高频线性部分斜率K,从腐蚀速度和腐蚀类型两方面研究了两种铝合金在模拟污染潮湿大气环境下的腐蚀行为,以及Cl-、NO3-和SO42-对铝合金大气腐蚀行为的影响和协同作用.     

基于PLC的等离子体干法刻蚀设备控制系统的设计

针对大型等离子体干法刻蚀生产设备的工艺特点,根据公司的生产实际需求,对原有损坏机台控制系统进行了重新改造设计。基于真空系统、工艺气体混合调节系统、射频微波放电系统、传动控制系统和终点检测系统等各子系统的控制难点及实现过程,设计了以三菱Q06 PLC为核心和In Touch 10.0为上位机监控软件的等离子体干法刻蚀设备控制系统。在In Touch 10.0平台上,搭建了等离子体干法刻蚀系统的监控界面,通过上位机处理大量生产制程数据和归档重要配方参数,实现生产工艺流程各个环节的实时监控、设备工作运行状态的参数显示和系统的故障报警等功能。     

归约算法统一描述

归约算法在并行计算中应用广泛,目前有很多归约算法应用于不同的情形。这些归约算法各不相同, 逻辑拓扑是 造成区别的关键 。为了统一描述归约算法,揭示它们的共性,给出了一个逻辑拓扑的定义及其性质。在此基础上,给出了归约算法的统一描述,以利于对归约算法的理解,从而设计适应不同应用和环境的归约算法。该描述也可视为可集成不同语义的归约算法框架,从而有助于设计具有新语义的归约算法。本质上,该统一描述是一个归约算法形式定义,有助于验证归约算法的正确性。     

针对未知稀疏信号的压缩自相关检测算法

针对未知的宽频带稀疏信号检测问题,提出了一种直接基于非重构采样值 的压缩自相关检测算法。首先利用压缩感知技术以远低于奈奎斯特采样速率获取信号,在自 相关矩阵检测信号理论的基础上,利用压缩感知中传感矩阵的严格等距特性,推导出基于统 计分布的信号稀疏系数自相关检测算法,从理论上给出了判决门限的选取和虚警概率之间的 关系,并进行了算法复杂度分析。由于无需重构原始信号,该算法直接利用少量的压缩测量 值进行检测,可以有效地提高检测过程的时效性。仿真表明在较低的信噪比时,该算法对未 知信号仍有良好的检测性能。     

Compressed sensing of superimposed chirps with adaptive dictionary refinement

The compressed sensing （CS） theory shows that accurate signal reconstruction depends on presetting an appropriate signal sparsifying dictionary. For CS of superimposed chirps, this dictionary is typically taken to be a waveform-matched dictionary formed by blindly diseretizing the frequency-chirp rate plane. However, since practical target parameters do not lie exactly on gridding points of the assumed dictionary, there is always mismatch between the assumed and the actual sparsifying dictionaries, which will cause the performance of conventional CS reconstruction methods to degrade considerably. To address this, we model the waveform- matched sparsifying dictionary as a parameterized one by treating its sampled frequency-chirp rate grid points as the underlying parameters. As a consequence, the sparsifying dictionary becomes refinable and its refinement can be achieved by optimizing the underlying parameters. Based on this, we develop a novel reconstruction algorithm for CS of superimposed chirps by utilizing the variational expectation-maximization （EM） algorithm. By alternating between steps of sparse coefficients estimation and dictionary parameters optimization, the algorithm integrates the process for dictionary refinement into that of signal reconstruction, and thus can achieve sparse reconstruction and dictionary optimization simultaneously. Experimental results demonstrate that the algorithm effectively deals with the performance degradation incurred by dictionary mismatch, and also outperforms the state-of-the-art CS reconstruction methods both in compressing the signal measurements and in suppressing the measurement noise.     

Regular corecursion in Prolog

Corecursion is the ability of defining a function that produces some infinite data in terms of the function and the data itself, as supported by lazy evaluation. However, in languages such as Haskell strict operations fail to terminate even on infinite regular data, that is, cyclic data.Regular corecursion is naturally supported by coinductive Prolog, an extension where predicates can be interpreted either inductively or coinductively, that has proved to be useful for formal verification, static analysis and symbolic evaluation of programs.In this paper we use the meta-programming facilities offered by Prolog to propose extensions to coinductive Prolog aiming to make regular corecursion more expressive and easier to program with.First, we propose a new interpreter to solve the problem of non-terminating failure as experienced with the standard semantics of coinduction (as supported, for instance, in SWI-Prolog). Another problem with the standard semantics is that predicates expressed in terms of existential quantification over a regular term cannot directly defined by coinduction; to this aim, we introduce finally clauses, to allow more flexibility in coinductive definitions.Then we investigate the possibility of annotating arguments of coinductive predicates, to restrict coinductive definitions to a subset of the arguments; this allows more efficient definitions, and further enhance the expressive power of coinductive Prolog.We investigate the effectiveness of such features by showing different example programs manipulating several kinds of cyclic values, ranging from automata and context free grammars to graphs and repeating decimals; the examples show how computations on cyclic values can be expressed with concise and relatively simple programs.The semantics defined by these vanilla meta-interpreters are an interesting starting point for a more mature design and implementation of coinductive Prolog.     

TD-SCDMA网络CS域业务接续时长的研究

在TD-SCDMA网络下,使用手机进行相互语音呼叫,采集呼叫信令,分析了不同网元处理呼叫信令的平均耗时情况,参照3GPP相关规范,并提出缩短TD-SCDMA网络CS域业务接续时长的策略。     

PLC在机房环境监控系统中的应用

基于PLC设计了一套机房环境监控系统,系统可监测机房环境、UPS运行状态、智能空调运行状态。系统可通过GSM短信息的方式将异常情况及时通知工作人员,实现机房的无人职守。     

Datalog逻辑程序调用语义及其应用研究

提出Datalog逻辑程序调用语义和调用谓词,说明包含程序调用谓词的可更新U-Datalog程序的操作语义及其固定点语义。提出在有限分层调用情况下U-Datalog程序的通用评价(evaluation)算法。最后对Datalog程序调用语义在数字版权语言中的应用做了说明并给出示例。